Large deviation sum-queue optimality of a radial sum-rate monotone opportunistic scheduler

نویسندگان

  • Bilal Sadiq
  • Gustavo de Veciana
چکیده

A centralized wireless system is considered that is serving a fixed set of users with time varying channel capacities. An opportunistic scheduling rule in this context selects a user (or users) to serve based on the current channel state and user queues. Unless the user traffic is symmetric and/or the underlying capacity region a polymatroid, little is known concerning how performance optimal schedulers should tradeoff maximizing current service rate (being opportunistic) versus balancing unequal queues (enhancing user-diversity to enable future high service rate opportunities). By contrast with currently proposed opportunistic schedulers, e.g., MaxWeight, Exp Rule, a radial sum-rate monotonic (RSM) scheduler de-emphasizes queuebalancing in favor of greedily maximizing the system service rate as the queue-lengths are scaled up linearly. In this paper it is shown that an RSM opportunistic scheduler, p-Log Rule, is not only throughput-optimal , but also maximizes the asymptotic exponential decay rate of the sum-queue distribution for a two-queue system. The model and result complement existing optimality results for opportunistic scheduling and point to RSM schedulers as a good design choice given the need for robustness in wireless systems with both heterogeneity and high degree of uncertainty.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The sum of two maximal monotone operator is of type FPV

In this paper, we studied maximal monotonicity of type FPV for sum of two maximal monotone operators of type FPV and the obtained results improve and complete the corresponding results of this filed.

متن کامل

Performance Analysis of a Heterogeneous Traffic Scheduler using Large Deviation Principle

In this paper, we analyze a scheduling algorithm which is suitable for the heterogeneous traffic network. In the large deviation setting, we are interested to see, how the asymptotic decay rate of maximum queue overflow probability achieved by this algorithm.We first derive an upper bound on the decay rate of the queue overflow probability as the queue overflow threshold approaches infinity. Th...

متن کامل

A Forward-Backward Projection Algorithm for Approximating of the Zero of the ‎S‎um of ‎T‎wo Operators

‎I‎n this paper‎, ‎a‎ forward-‎b‎ackward projection algorithm is considered for finding zero points of the sum of two operators‎ ‎in Hilbert spaces‎. ‎The sequence generated by algorithm converges strongly to the zero point of the sum of an $alpha$-inverse strongly‎ ‎monotone operator and a maximal monotone operator‎. ‎We apply the result for solving the variational inequality problem, fixed po...

متن کامل

Largest Weighted Delay First Scheduling : Large Deviations and Optimality

We consider a single server system with N input flows. We assume that each flow has stationary increments and satisfies a sample path large deviation principle, and that the system is stable. We introduce the largest weighted delay first (LWDF) queueing discipline associated with any given weight vector α = α1 αN . We show that under the LWDF discipline the sequence of scaled stationary distrib...

متن کامل

Opportunistic Random Beamforming with Mmse Precoding for Spatially Correlated Channels

It has been showed recently that dirty paper coding (DPC) achieves optimum sum-rate capacity in a multiple-input multiple output (MIMO) Gaussian broadcast channels. Unfortunately, this scheme is computationally expensive (complex) at the receiver and transmitter and requires full channel state information (CSI) feedback from all users. Simpler less complex schemes like opportunistic random beam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0906.4597  شماره 

صفحات  -

تاریخ انتشار 2009